The Complexity of angel-daemons and game isomorphism

The analysis of the computational aspects of strategic situations is a basic field in Computer Sciences. Two main topics related to strategic games have been developed. First, introduction and analysis of a class of games (so called angel/daemon games) designed to asses web applications, have been considered. Second, the problem of isomorphism between strategic games has been analysed. Both parts have been separately considered. Angel-Daemon Games A service is a computational method that is made available for general use through a wide area network. The performance of web-services may fluctuate; at times of stress the performance of some services may be degraded (in extreme cases, to the point of failure). In this thesis uncertainty profiles and Angel-Daemon games are used to analyse servicebased behaviours in situations where probabilistic reasoning may not be appropriate. In such a game, an angel player acts on a bounded number of ¿angelic¿ services in a beneficial way while a daemon player acts on a bounded number of ¿daemonic¿ services in a negative way. Examples are used to illustrate how game theory can be used to analyse service-based scenarios in a realistic way that lies between over-optimism and over-pessimism. The resilience of an orchestration to service failure has been analysed - here angels and daemons are used to model services which can fail when placed under stress. The Nash equilibria of a corresponding Angel-Daemon game may be used to assign a ¿robustness¿ value to an orchestration. Finally, the complexity of equilibria problems for Angel-Daemon games has been analysed. It turns out that Angel-Daemon games are, at the best of our knowledge, the first natural example of zero-sum succinct games. The fact that deciding the existence of a pure Nash equilibrium or a dominant strategy for a given player is Sp 2-complete has been proven. Furthermore, computing the value of an Angel-Daemon game is EXP-complete. Thus, matching the already known complexity results of the corresponding problems for the generic families of succinctly represented games with exponential number of actions. Game Isomorphism The question of whether two multi-player strategic games are equivalent and the computational complexity of deciding such a property has been addressed. Three notions of isomorphisms, strong, weak and local have been considered. Each one of these isomorphisms preserves a different structure of the game. Strong isomorphism is defined to preserve the utility functions and Nash equilibria. Weak isomorphism preserves only the player preference relations and thus pure Nash equilibria. Local isomorphism preserves preferences defined only on ¿close¿ neighbourhood of strategy profiles. The problem of the computational complexity of game isomorphism, which depends on the level of succinctness of the description of the input games but it is independent of the isomorphism to consider, has been shown. Utilities in games can be given succinctly by Turing machines, boolean circuits or boolean formulas, or explicitly by tables. Actions can be given also explicitly or succinctly. When the games are given in general form, an explicit description of actions and a succinct description of utilities have been assumed. It is has been established that the game isomorphism problem for general form games is equivalent to the circuit isomorphism when utilities are described by Turing Machines; and to the boolean formula isomorphism problem when utilities are described by formulas. When the game is given in explicit form, it is has been proven that the game isomorphism problem is equivalent to the graph isomorphism problem. Finally, an equivalence classes of small games and their graphical representation have been also examined.Postprint (published version

A list of parameterized problems in bioinformatics

In this report we present a list of problems that originated in bionformatics. Our aim is to collect information on such problems that have been analyzed from the point of view of Parameterized Complexity. For every problem we give its definition and biological motivation together with known complexity results.Postprint (published version

A list of parameterized problems in bioinformatics

In this report we present a list of problems that originated in bionformatics. Our aim is to collect information on such problems that have been analyzed from the point of view of Parameterized Complexity. For every problem we give its definition and biological motivation together with known complexity results

Derechos humanos y grupos vulnerables en Centroamérica y el Caribe, Tomo I

Derechos Humanos y grupos vulnerables en Centroamérica y el Caribe identifica, con un enfoque inclusivo, todos los grupos de personas que se en encuentran en situación de vulnerabilidad en Centroamérica y el Caribe, en una serie de estudios realizados por destacadas especialistas regionales y subregionales, en los dos tomos que integran esta obra. el primer tomo aborda tres grupos vulnerables: las mujeres, los migrantes y los niños y niñas y adolescentes. El segundo tomo se dedica al análisis de otros grupos vulnerables como las personas mayores, las personas víctimas de desplazamiento forzado, las personas con discapacidad, las personas defensoras de derechos humanos y los pueblos indígenas, entre otros. Los objetivos de esta coordinación son, por una parte, reconocer el ámbito protector que constituye el sistema interamericano de derechos humanos, y por otra parte, contribuir a la comprensión panorámica y a la vez profunda del estadio de desarrollo en el que se encuentran la jusciabilidad, la jurisprudencia y la sociología jurídica de los derechos humanos de los grupos más vulnerables de la subregión de Centroamérica y el Caribe.Universidad Nacional Autónoma de México/Programa de Apoyo a Proyectos de Investigación e Innovación Tecnológica/"PAPIIT IA 300117"//[Envejecimiento de la población en América Central y las Antillas Mayores en el siglo XXI. Aspectos sociodemográficos, de economía política y de derechos humanos]Libro

Clinical and genetic characteristics of late-onset Huntington's disease

Background: The frequency of late-onset Huntington's disease (>59 years) is assumed to be low and the clinical course milder. However, previous literature on late-onset disease is scarce and inconclusive. Objective: Our aim is to study clinical characteristics of late-onset compared to common-onset HD patients in a large cohort of HD patients from the Registry database. Methods: Participants with late- and common-onset (30–50 years)were compared for first clinical symptoms, disease progression, CAG repeat size and family history. Participants with a missing CAG repeat size, a repeat size of ≤35 or a UHDRS motor score of ≤5 were excluded. Results: Of 6007 eligible participants, 687 had late-onset (11.4%) and 3216 (53.5%) common-onset HD. Late-onset (n = 577) had significantly more gait and balance problems as first symptom compared to common-onset (n = 2408) (P <.001). Overall motor and cognitive performance (P <.001) were worse, however only disease motor progression was slower (coefficient, −0.58; SE 0.16; P <.001) compared to the common-onset group. Repeat size was significantly lower in the late-onset (n = 40.8; SD 1.6) compared to common-onset (n = 44.4; SD 2.8) (P <.001). Fewer late-onset patients (n = 451) had a positive family history compared to common-onset (n = 2940) (P <.001). Conclusions: Late-onset patients present more frequently with gait and balance problems as first symptom, and disease progression is not milder compared to common-onset HD patients apart from motor progression. The family history is likely to be negative, which might make diagnosing HD more difficult in this population. However, the balance and gait problems might be helpful in diagnosing HD in elderly patients